Computing almost minimal formulas on the square
نویسندگان
چکیده
منابع مشابه
Computing almost minimal formulas on the square
The main purpose of this paper is to introduce a numerical method for the computation of cubature rules in the square [−1, 1]2 that are almost minimal, i.e. with few points w.r.t. the degree of precision d. In particular for all 24 ≤ d ≤ 55 the sets ξd and the weights {wk} are new. New rules are also achieved for degrees 15, d = 17, 19 and d = 23 respectively with 43, 54, 67 and 96 points.
متن کاملOn the Complexity of Computing Minimal Unsatisfiable LTL formulas
We show that (1) the Minimal False QCNF search-problem (MF-search) and the Minimal Unsatisfiable LTL formula search problem (MU-search) are FPSPACE complete because of the very expressive power of QBF/LTL, (2) we extend the PSPACE-hardness of the MF decision problem to the MU decision problem. As a consequence, we deduce a positive answer to the open question of PSPACE hardness of the inherent ...
متن کاملOn Minimal and Almost-Minimal Linear Codes
Minimal linear codes are such that the support of every codeword does not contain the support of another linearly independent codeword. Such codes have applications in cryptography, e.g. to secret sharing and secure two-party computations. We pursue here the study of minimal codes and construct infinite families with asymptotically non-zero rates. We also introduce a relaxation to almost minima...
متن کاملOn the Size of Minimal Unsatisfiable Formulas
An unsatisfiable formula is called minimal if it becomes satisfiable whenever any of its clauses are removed. We construct minimal unsatisfiable k-SAT formulas with Ω(nk) clauses for k ≥ 3, thereby negatively answering a question of Rosenfeld. This should be compared to the result of Lovász [Studia Scientiarum Mathematicarum Hungarica 11, 1974, p113-114] which asserts that a critically 3-chroma...
متن کاملAlmost Online Square Packing
In the square packing problem, the goal is to pack squares of different sizes into the smallest number of bins (squares) of uniform size. We introduce an almostonline square packing algorithm which places squares in an online, sequential manner. In doing so, it receives advice of logarithmic size from an offline oracle which runs in linear time. Our algorithm achieve a competitive ratio of at m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2012
ISSN: 0377-0427
DOI: 10.1016/j.cam.2012.05.021